Inexact search looks for solutions that are good enough or nearly right as opposed to the very best solution. While deterministic search algorithms can find the optimal solution, they may not be able to cope with complex or large search spaces. Inexact searches include simulated annealing and hill climbing with random starts.
Defined on page 75
Used on Chap. 4: page 75